On the generalized A-spectral characterizations of almost α-controllable graphs

The A α matrix of a graph G is defined by ( ) = D + 1 − , 0 ≤ where the diagonal degrees and adjacency . -spectrum denoted S p e c set eigenvalues together with their multiplicities said to be determined generalized for short), if any H ¯ isomorphic In this paper, we present simple arithmetic condition an almost -controllable being which generalizes main results in [17]